Algorithmic and Human Collusion

نویسندگان

چکیده

As self-learning pricing algorithms become popular, there are growing concerns among academics and regulators that could learn to collude tacitly on non-competitive prices thereby harm competition. I study popular reinforcement learning show they develop collusive behavior in a simulated market environment. To derive counterfactual resembles traditional tacit collusion, conduct experiments with human participants the same Across different treatments, vary size number of firms use self-learned algorithm. provide evidence oligopoly markets can more if make decisions instead humans. In two-firm markets, weakly increasing market. three-firm weaken competition most an algorithm sellers inexperienced.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithmic Collusion in Cournot Duopoly Market: Evidence from Experimental Economics

Algorithmic collusion is an emerging concept. Whether algorithmic collusion is a creditable threat remains as an argument. In this paper, we propose an algorithm which can extort its human rival to collude in a Cournot duopoly competing market. In experiments, we show that, the algorithm can successfully extort its human rival and gets higher profit in long-run, meanwhile the human rival will f...

متن کامل

Algorithmic Mechanisms for Reliable Crowdsourcing Computation under Collusion

We consider a computing system where a master processor assigns a task for execution to worker processors that may collude. We model the workers' decision of whether to comply (compute the task) or not (return a bogus result to save the computation cost) as a game among workers. That is, we assume that workers are rational in a game-theoretic sense. We identify analytically the parameter condit...

متن کامل

Algorithmic Mechanisms for Reliable Internet-based Computing under Collusion

In this work, using a game-theoretic approach, cost-sensitive mechanisms that lead to reliable Internet-based computing are designed. In particular, we consider Internet-based master-worker computations, where a master processor assigns, across the Internet, a computational task to a set of potentially untrusted worker processors and collects their responses. Workers may collude in order to inc...

متن کامل

Human Algorithmic Stability and Human Rademacher Complexity

In Machine Learning (ML), the learning process of an algorithm given a set of evidences is studied via complexity measures. The way towards using ML complexity measures in the Human Learning (HL) domain has been paved by a previous study, which introduced Human Rademacher Complexity (HRC): in this work, we introduce Human Algorithmic Stability (HAS). Exploratory experiments, performed on a grou...

متن کامل

Competition Policy, Collusion, and Tacit Collusion

In this paper, I pursue three goals. The first is to model collusion in a way that is distinct from noncooperative collusion. The second and third are to develop a particular specification of a standard model of noncooperative collusion that permits explicit solution for equilibrium outputs and reversion thresholds and to extend this analysis to allow for a deterrence-based competition policy t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Social Science Research Network

سال: 2021

ISSN: ['1556-5068']

DOI: https://doi.org/10.2139/ssrn.3960738